MATHEMATICAL ENGINEERING TECHNICAL REPORTS Semidefinite Programming for Uncertain Linear Equations in Static Analysis of Structures
نویسندگان
چکیده
This paper presents a method for computing a minimal bounding ellipsoid that contains the solution set to the uncertain linear equations. Particularly, we aim at finding a bounding ellipsoid for static response of structures, where both external forces and elastic moduli of members are assumed to be imprecisely known and bounded. By using the Slemma, we formulate a semidefinite programming (SDP) problem which provides an outer approximation of the minimal bounding ellipsoid. The minimum bounding ellipsoids are computed for nodal displacements of uncertain braced frames as the solutions of the presented SDP problems by using the primal-dual interior-point method.
منابع مشابه
A Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Ellipsoidal Bounds for Static Response of Framed Structures against Interactive Uncertainties
This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. We assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded, which is a non-stochastic model of uncertainty. A brace member represents the sum of the stiffness of the actual brace and the con...
متن کاملSemidefinite Programming for Uncertain Linear Equations in Static Analysis of Structures
This paper presents a method for computing a minimal bound that contains the solution set to the uncertain linear equations. Particularly, we aim at finding a bounding ellipsoid for static response of structures, where both external forces and elastic moduli of members are assumed to be imprecisely known and bounded. By using the S-lemma, we formulate a semidefinite programming (SDP) problem wh...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Semidefinite Programming for Dynamic Steady-State Analysis of Structures under Uncertain Harmonic Loads
This paper presents semidefinite programming approaches for computing confidential bounds for the dynamic steady-state responses of a damped structure subjected to uncertain driving loads. We assume that amplitudes of harmonic driving loads obey a non-probabilistic uncertainty model. The semidefinite programming problems are formulated for finding confidential bounds for various characteristic ...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Eigenvalue Optimization of Structures via Polynomial Semidefinite Programming
This paper presents a sequential semidefinite programming (SDP) approach to maximize the minimal eigenvalue of the generalized eigenvalue problem, in which the two symmetric matrices defining the eigenvalue problem are supposed to be the polynomials in terms of the variables. An important application of this problem is found in the structural optimization which attempts to maximize the minimal ...
متن کامل